Updating Metalogic Programs by Rebinding Names
نویسنده
چکیده
Amalgamated logic programming can be used to express relationships between two theories which can be interpreted as a transformation from one theory to another, so providing a form of logical update. In a system representing objects as theories this can explain state updates of objects but it does not account properly for object identiiers. We describe a notion of rebinding for object identiiers, and for primitive names of theories in general, which accounts for the change to object identiiers.
منابع مشابه
On the Declarative and Procedural Semantics of Definite Metalogic Programs
We present a declarative and procedural semantics for an amalgamation of object language and metalanguage. We define the class of definite metalogic programs, based on a definite clause language, a binary demonstration predicate, and a naming scheme with both primitive and structured names. The declarative semantics is an extension of the semantics of logic programs dealing with multiple theori...
متن کاملHigh-level programming language design for distributed computation Design rationale and language definition
This paper studies key issues for distributed programming in high-level languages. We discuss the design space and describe an experimental language, Acute, which we have defined and implemented. Acute extends an OCaml core to support distributed development, deployment, and execution, allowing typesafe interaction between separately-built programs. It is expressive enough to enable a wide vari...
متن کاملAcute: High-level programming language design for distributed computation : Design rationale and language definition
This paper studies key issues for distributed programming in high-level languages. We discuss the design space and describe an experimental language, Acute, which we have defined and implemented. Acute extends an OCaml core to support distributed development, deployment, and execution, allowing typesafe interaction between separately-built programs. It is expressive enough to enable a wide vari...
متن کاملInductive Metalogic Programming 1
We propose a metalogic programming method for eecient induction of a fairly large class of list-handling logic programs delineated through restrictions on the hypothesis language. These restrictions take the form of predeened program recursion schemes (higher order \clich es") from which the hypotheses programs in the induction process are derived by plugging in either simple, nonrecursive clau...
متن کاملIncremental rebinding with name polymorphism 1 Davide Ancona
We propose an extension with name variables of a calculus for incremental rebinding of code introduced in previous work. Names, which can be either constants or variables, are used as interface of fragments of code with free variables. Open code can be dynamically rebound by applying a rebinding, which is an association from names to terms. Rebindings can contain free variables as well, hence r...
متن کامل